Exact reproduction of colored images
نویسندگان
چکیده
منابع مشابه
Exact reproduction of colored images
The problem of producing a colored image from a colored original is analyzed. Conditions are determined for the production of an image in which the colors cannot be distinguished form those in the original by a human observer. If the final image is produced by superposition of controlled amounts of colored lights, only a simple linear transform need be applied to the outputs of the image sensor...
متن کاملA stack-based chaotic algorithm for encryption of colored images
In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...
متن کاملSteganography for Colored Images
In this paper, we present a novel method to embedding secret message in the cover-image. The basic concept of the proposed method is by simple Least Significant Bit (LSB) substitution. We propose a steganography method that applies a technique to embedding a wavelet compressed secret message within the Least Significant Bit (LSB) of the cover image pixels in a specific pattern. The proposed met...
متن کاملSteganalysis of Colored JPEG Images
Images, especially colored JPEG images, are increasingly being used as cover by many steganography techniques. Steganalysis detects the presence of message embedded by steganography techniques. Many authors have given different steganalysis techniques which differ mainly on the feature sets being used. In this paper we are comparing feature sets of six of these steganalysis techniques for multi...
متن کاملExact Algorithms for Intervalizing Colored Graphs
In the Intervalizing Colored Graphs problem, one must decide for a given graph G = (V,E) with a proper vertex coloring of G whether G is the subgraph of a properly colored interval graph. For the case that the number of colors k is xed, we give an exact algorithm that uses O∗(2n/log (n)) time for all > 0. We also give an O∗(2n) algorithm for the case that the number of colors k is not xed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision, Graphics, and Image Processing
سال: 1983
ISSN: 0734-189X
DOI: 10.1016/0734-189x(83)90090-7